On the dimension of twisted centralizer codes

نویسندگان

  • Adel Alahmadi
  • Stephen P. Glasby
  • Cheryl E. Praeger
چکیده

Given a field F , a scalar λ ∈ F and a matrix A ∈ F, the twisted centralizer code CF (A, λ) := {B ∈ F | AB − λBA = 0} is a linear code of length n. When A is cyclic and λ 6= 0 we prove that dimCF (A, λ) = deg(gcd(cA(t), λcA(λt))) where cA(t) denotes the characteristic polynomial of A. We also show how CF (A, λ) decomposes, and we estimate the probability that CF (A, λ) is nonzero when |F | is finite. Finally, we prove dimCF (A, λ) 6 n /2 for λ 6∈ {0, 1} and ‘almost all’ matrices A.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized twisted centralizer codes

An important code of length n is obtained by taking centralizer of a square matrix over a finite field Fq. Twisted centralizer codes, twisted by an element a ∈ Fq, are also similar type of codes but different in nature. The main results were embedded on dimension and minimum distance. In this paper, we have defined a new family of twisted centralizer codes namely generalized twisted centralizer...

متن کامل

Twisted Centralizer Codes

Given an n× n matrix A over a field F and a scalar a ∈ F , we consider the linear codes C(A, a) := {B ∈ F | AB = aBA} of length n2. We call C(A, a) a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when a = 1) is at most n, howe...

متن کامل

Centralizer Construction for Twisted Yangians

For each of the classical Lie algebras g(n) = o(2n+ 1), sp(2n), o(2n) of type B, C, D we consider the centralizer of the subalgebra g(n−m) in the universal enveloping algebra U(g(n)). We show that the nth centralizer algebra can be naturally projected onto the (n− 1)th one, so that one can form the projective limit of the centralizer algebras as n → ∞ with m fixed. The main result of the paper ...

متن کامل

Some new quasi - twisted ternary linear codes ∗

Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...

متن کامل

Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography

We present a generalisation of Twisted Reed– Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality. Furthermore, we study the Schur squares of the new codes and show that their dimension is often large. Using these structural properties, we single out a subfamily of the new codes which could be considered fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2017